COMMENT ⊗   VALID 00006 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	 People to contact with results.
C00003 00003	∂22-Jul-82  2009	patel at UCLA-Security (Dorab Patel) 	benchmarks  
C00004 00004	∂29-Jul-82  1420	John Amuedo <JOHANN at MIT-ML>
C00006 00005	∂16-Aug-82  0911	BERN at MIT-DMS (Bern Niamir) 	68000 timings 
C00007 00006	∂24-Aug-82  1414	PUDER at Wharton-10 (Karl Puder) 	benchmark data  
C00008 ENDMK
C⊗;
;;; People to contact with results.
Kindly call Dr.Findler 602 965 5934 at Arizona State - if can't do it today
call him mon at 11 calif time.

1xerox
2foonly
3lmi
4symbolics
Dr. Nicholas Findler
Computer Science Dept
Arizona State University
Tempe AZ 85287
(602)965 5934
(602)965-3290
∂22-Jul-82  2009	patel at UCLA-Security (Dorab Patel) 	benchmarks  
Date: 22 July 1982 1439-PDT (Thursday)
From: patel at UCLA-Security (Dorab Patel)
Subject: benchmarks
To: rpg at su-ai
CC: patel

Dick,

fateman@berkeley mentioned to me that you have a collection of
benchmark programs for Lisp and some data on various computers.
I would be very interested in knowing the results and the programs you
used. I am specifically interested in Lisp benchmarks oriented towards
CAD applications.

Thanks,		Dorab

∂29-Jul-82  1420	John Amuedo <JOHANN at MIT-ML>
Date: 29 July 1982 17:20-EDT
From: John Amuedo <JOHANN at MIT-ML>
To: rpg at SU-AI

Hi -- Heard you have been collecting some performance
statistics on lisp machines.  I really need some
information comparing single-precision floating point
computation times on Dolphins, LMI and Symbolics
lisp machines.  The operations I'm primarily interested
in are floating point ADD, MULTIPLY, DIVIDE, SQUARE-ROOT,
EXPONENTIATE, ARRAY-REFERENCE, and ARRAY-REPLACE.  Know
how I can find this information quickly?
  Thanks much,
  John Amuedo
  JOHANN@MIT-AI.
P.S. Send me a phone number or two where I can reach you.

∂16-Aug-82  0911	BERN at MIT-DMS (Bern Niamir) 	68000 timings 
Date: 16 Aug 1982 1211-EDT
From: BERN at MIT-DMS (Bern Niamir)
To: rpg at SU-AI
Subject: 68000 timings
Message-id: <[MIT-DMS].241032>

Would you happen to know if there are any 68000 specific benchmarks
available, whether in assembly or in C?  I am aware of Forest Basketts
Puzzle.  I was wondering if you have heard of anything besides that?
	Thanks, Bern
Also, do you know of any memo or report that guides one in creating
benchmarks?


∂24-Aug-82  1414	PUDER at Wharton-10 (Karl Puder) 	benchmark data  
Date: 24 Aug 1982 (Tuesday) 1710-EDT
From: PUDER at Wharton-10 (Karl Puder)
Subject: benchmark data
To:   rpg at SU-AI

At the AAAI conference last week, Lynette Hirschman and I discussed your
work with Larry Masinter on benchmarking and analysis of LISP machine
speeds.  We realize that your data are not yet completely collated, but
would like to know what you have so far.  The data you have collected is
surely more useful than what we found out at the demonstration tables.
Thanks for your help.
			Karl Puder	(PUDER@Wharton-10)